Computable Convergence Rates for Subgeometrically Ergodic Markov Chains
نویسندگان
چکیده
In this paper, we give quantitative bounds on the f -total variation distance from convergence of an Harris recurrent Markov chain on an arbitrary under drift and minorisation conditions implying ergodicity at a sub-geometric rate. These bounds are then specialized to the stochastically monotone case, covering the case where there is no minimal reachable element. The results are illustrated on two examples from queueing theory and Markov Chain Monte Carlo. AMS 2000 MSC 60J10 Stochastic monotonicity; rates of convergence; Markov chains
منابع مشابه
Renewal theory and computable convergence rates for geometrically ergodic Markov chains
We give computable bounds on the rate of convergence of the transition probabilities to the stationary distribution for a certain class of geometrically ergodic Markov chains. Our results are different from earlier estimates of Meyn and Tweedie, and from estimates using coupling, although we start from essentially the same assumptions of a drift condition towards a “small set”. The estimates sh...
متن کاملSubgeometric rates of convergence of f -ergodic strong Markov processes
We provide a condition for f -ergodicity of strong Markov processes at a subgeometric rate. This condition is couched in terms of a supermartingale property for a functional of the Markov process. Equivalent formulations in terms of a drift inequality on the extended generator and on the resolvent kernel are given. Results related to (f, r)-regularity and to moderate deviation principle for int...
متن کاملA constructive law of large numbers with application to countable Markov chains
Let X1,X2, . . . be a sequence of identically distributed, pairwise independent random variables with distribution P. Let the expected value be μ < ∞. Let S n = ∑i=1 Xi. It is well-known that S n/n converges to μ almost surely. We show that this convergence is effective in (P,μ). In particular, if P,μ are computable then the convergence is effective. On the other hand, if the convergence is eff...
متن کاملSubgeometric rates of convergence of f -ergodic Markov chains
We study bounds on the rate of convergence of aperiodic Markov chains on a general state space to the stationary distribution. Our results generalize previous results on convergence rates for Markov chains [23]. We also improve results from [9] on convergence rates in the local renewal theorem. The results are applied to delayed random walks.
متن کاملOn the Geometric Ergodicity of Two-variable Gibbs Samplers
A Markov chain is geometrically ergodic if it converges to its invariant distribution at a geometric rate in total variation norm. We study geometric ergodicity of deterministic and random scan versions of the two-variable Gibbs sampler. We give a sufficient condition which simultaneously guarantees both versions are geometrically ergodic. We also develop a method for simultaneously establishin...
متن کامل